AC Optimal Power Flow: a Conic Programming relaxation and an iterative MILP scheme for Global Optimization
نویسندگان
چکیده
We address the issue of computing a global minimizer AC Optimal Power Flow problem. introduce valid inequalities to strengthen Semidefinite Programming relaxation, yielding novel Conic relaxation. Leveraging these constraints, we dynamically generate Mixed-Integer Linear (MILP) relaxations, whose solutions asymptotically converge minimizers apply this iterative MILP scheme on IEEE PES PGLib [2] benchmark and compare results with two recent Global Optimization approaches.
منابع مشابه
Global Quadratic Optimization via Conic Relaxation
We present a convex conic relaxation for a problem of maximizing an indefinite quadratic form over a set of convex constraints on the squared variables. We show that for all these problems we get at least 12 37 -relative accuracy of the approximation. In the second part of the paper we derive the conic relaxation by another approach based on the second order optimality conditions. We show that ...
متن کاملA New Solution for Stochastic Optimal Power Flow: Combining Limit Relaxation with Iterative Learning Control
A stochastic optimal power flow (S-OPF) model considering uncertainties of load and wind power is developed based on chance constrained programming (CCP). The difficulties in solving the model are the nonlinearity and probabilistic constraints. In this paper, a limit relaxation approach and an iterative learning control (ILC) method are implemented to solve the S-OPF model indirectly. The limit...
متن کاملA Conic Optimal Power Flow with Uncertain Prices
The interconnection of modern electric power systems allows utilities to obtain significant savings in operational cost by scheduling power purchases. In a deregulated environment, utilities have only partial knowledge of the price of power available in the market. This paper presents a solution to the optimal power purchase problem in a utility by considering ellipsoidal cost coefficient uncer...
متن کاملA Global Algorithm for Quadratic Programming with One Negative Eigenvalue Based on Successive Linear Conic Optimization and Convex Relaxation
We consider quadratic programs with a single negative eigenvalue (QP1NE) subject to linear and conic constraints. The QP1NE model covers the classical clique problem that is known to be NP-hard [26]. In this paper, by combining successive linear conic optimization (SLCO), convex relaxation and line search technique, we present a global algorithm for QP1NE which can locate a global optimal solut...
متن کاملInexactness of SDP Relaxation for Optimal Power Flow over Radial Networks and Valid Inequalities for Global Optimization
It has been recently proven that the semidefinite programming (SDP) relaxation of the optimal power flow problem over radial networks is exact in the absence of generation lower bounds. In this paper, we investigate the situation where generation lower bounds are present. We show that even for a two-bus one-generator system, the SDP relaxation can have all possible approximation outcomes, that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open journal of mathematical optimization
سال: 2022
ISSN: ['2777-5860']
DOI: https://doi.org/10.5802/ojmo.17